Probabilistic Belief Contraction Using Argumentation

نویسندگان

  • Kinzang Chhogyal
  • Abhaya C. Nayak
  • Zhiqiang Zhuang
  • Abdul Sattar
چکیده

When a belief state is represented as a probability function P , the resulting belief state of the contraction of a sentence (belief) from the original belief state P can be given by the probabilistic version of the Harper Identity. Specifically, the result of contracting P by a sentence h is taken to be the mixture of two states: the original state P , and the resultant state P ∗ ¬h of revising P by the negation of h. What proportion of P and P ∗ ¬h should be used in this mixture remains an open issue and is largely ignored in literature. In this paper, we first classify different belief states by their stability, and then exploit the quantitative nature of probabilities and combine it with the basic ideas of argumentation theory to determine the mixture proportions. We, therefore, propose a novel approach to probabilistic belief contraction using argumentation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Belief in Attacks in Epistemic Probabilistic Argumentation

The epistemic approach to probabilistic argumentation assigns belief to arguments. This is valuable in dialogical argumentation where one agent can model the beliefs another agent has in the arguments and this can be harnessed to make strategic choices of arguments to present. In this paper, we extend this epistemic approach by also representing the belief in attacks. We investigate properties ...

متن کامل

Text Classification Using Belief Augmented Frames

In this paper we present our work on applying Belief Augmented Frames to the text classification problem. We formulate the problem in two alternative ways, and we evaluate the performance of both formulations against established text classification algorithms. We also compare the performance against a text classifier based on Probabilistic Argumentation System, an alternative argumentation syst...

متن کامل

Probabilistic argumentation systems: a new perspective on the dempster-shafer theory

The goal of this paper is to study the connection between Dempster-Shafer theory and probabilistic argumentation systems. By introducing a general method to translate probabilistic argumentation systems into corresponding Dempster-Shafer belief potentials, its contribution is twofold. On the one hand, the paper proposes probabilistic argumentation systems as a convenient and powerful modeling l...

متن کامل

Probabilistic Argumentation Systems: a New Perspective on Dempster-Shafer Theory

The goal of this paper is to study the connection between Dempster-Shafer theory and probabilistic argumentation systems. By introducing a general method to translate probabilistic argumentation systems into corresponding Dempster-Shafer belief potentials, its contribution is twofold. On the one hand, the paper proposes probabilistic argumentation systems as a convenient and powerful modeling l...

متن کامل

Combination Algorithm of Probabilistic Argumentation Systems Based on Evidence Theory

Probabilistic Argumentation Systems is an alternative approach for non-monotonic reasoning under uncertainty. It can judge an unknown question in terms of the degree of support and that of possibility about probabilistic entailment. The resulting degree of support and degree of possibility correspond to belief and plausibility, respectively, in the Dempster-Shafer theory of evidence. But the sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015